A Concurrent Lambda Calculus with Futures
Identifieur interne : 000069 ( France/Analysis ); précédent : 000068; suivant : 000070A Concurrent Lambda Calculus with Futures
Auteurs : Joachim Niehren [France] ; Jan Schwinghammer [Allemagne] ; Gert Smolka [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: We introduce a new concurrent lambda calculus with futures, λ (fut), to model the operational semantics of Alice, a concurrent extension of ML. λ (fut) is a minimalist extension of the call-by-value λ-calculus that yields the full expressiveness to define, combine, and implement a variety of standard concurrency constructs such as channels, semaphores, and ports. We present a linear type system for λ (fut) by which the safety of such definitions and their combinations can be proved: Well-typed implementations cannot be corrupted in any well-typed context.
Url:
DOI: 10.1007/11559306_14
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002D39
- to stream Istex, to step Curation: 002878
- to stream Istex, to step Checkpoint: 001251
- to stream Main, to step Merge: 001948
- to stream Main, to step Curation: 001922
- to stream Main, to step Exploration: 001922
- to stream France, to step Extraction: 000069
Links to Exploration step
ISTEX:943B9C28DE70D11EA75239DE7495FA656B7A3144Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Concurrent Lambda Calculus with Futures</title><author><name sortKey="Niehren, Joachim" sort="Niehren, Joachim" uniqKey="Niehren J" first="Joachim" last="Niehren">Joachim Niehren</name></author><author><name sortKey="Schwinghammer, Jan" sort="Schwinghammer, Jan" uniqKey="Schwinghammer J" first="Jan" last="Schwinghammer">Jan Schwinghammer</name></author><author><name sortKey="Smolka, Gert" sort="Smolka, Gert" uniqKey="Smolka G" first="Gert" last="Smolka">Gert Smolka</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:943B9C28DE70D11EA75239DE7495FA656B7A3144</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11559306_14</idno><idno type="url">https://api.istex.fr/document/943B9C28DE70D11EA75239DE7495FA656B7A3144/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002D39</idno><idno type="wicri:Area/Istex/Curation">002878</idno><idno type="wicri:Area/Istex/Checkpoint">001251</idno><idno type="wicri:doubleKey">0302-9743:2005:Niehren J:a:concurrent:lambda</idno><idno type="wicri:Area/Main/Merge">001948</idno><idno type="wicri:Area/Main/Curation">001922</idno><idno type="wicri:Area/Main/Exploration">001922</idno><idno type="wicri:Area/France/Extraction">000069</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Concurrent Lambda Calculus with Futures</title><author><name sortKey="Niehren, Joachim" sort="Niehren, Joachim" uniqKey="Niehren J" first="Joachim" last="Niehren">Joachim Niehren</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LIFL, INRIA Futurs, Lille</wicri:regionArea><placeName><settlement type="city">Lille</settlement></placeName></affiliation></author><author><name sortKey="Schwinghammer, Jan" sort="Schwinghammer, Jan" uniqKey="Schwinghammer J" first="Jan" last="Schwinghammer">Jan Schwinghammer</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Programming Systems Lab, Saarland University, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author><author><name sortKey="Smolka, Gert" sort="Smolka, Gert" uniqKey="Smolka G" first="Gert" last="Smolka">Gert Smolka</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Programming Systems Lab, Saarland University, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">943B9C28DE70D11EA75239DE7495FA656B7A3144</idno><idno type="DOI">10.1007/11559306_14</idno><idno type="ChapterID">Chap14</idno><idno type="ChapterID">14</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We introduce a new concurrent lambda calculus with futures, λ (fut), to model the operational semantics of Alice, a concurrent extension of ML. λ (fut) is a minimalist extension of the call-by-value λ-calculus that yields the full expressiveness to define, combine, and implement a variety of standard concurrency constructs such as channels, semaphores, and ports. We present a linear type system for λ (fut) by which the safety of such definitions and their combinations can be proved: Well-typed implementations cannot be corrupted in any well-typed context.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>France</li></country><region><li>Sarre (Land)</li></region><settlement><li>Lille</li><li>Sarrebruck</li></settlement></list><tree><country name="France"><noRegion><name sortKey="Niehren, Joachim" sort="Niehren, Joachim" uniqKey="Niehren J" first="Joachim" last="Niehren">Joachim Niehren</name></noRegion></country><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Schwinghammer, Jan" sort="Schwinghammer, Jan" uniqKey="Schwinghammer J" first="Jan" last="Schwinghammer">Jan Schwinghammer</name></region><name sortKey="Smolka, Gert" sort="Smolka, Gert" uniqKey="Smolka G" first="Gert" last="Smolka">Gert Smolka</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000069 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000069 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:943B9C28DE70D11EA75239DE7495FA656B7A3144
|texte= A Concurrent Lambda Calculus with Futures
}}
| This area was generated with Dilib version V0.6.20. |  |